Path decomposition - PDFSEARCH.IO - Document Search Engine

Path decomposition
Results: 318

#	Item
101	24 IP1 ”If You Can Specify It, You Can Analyze It” —The Lasting Legacy of Philippe Flajolet The ”Flajolet School” of the analysis of algorithms and Add to Reading List Source URL: www.siam.org Language: English - Date: 2012-12-18 10:42:32 Algorithm Mathematical logic Shortest path problem Matching Tree decomposition Matroid Combinatorics Randomized algorithm Mathematics Theoretical computer science Graph theory
102	Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing C. Borgsa , J.T. Chayesa , L. Lov´asza∗, V.T. S´osb†, K. Vesztergombic a b Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2007-01-31 16:12:19 Random graph Graph coloring Graph Degree Line graph Path decomposition Graph theory Mathematics Theoretical computer science
103	Confluence in Data Reduction: Bridging Graph Transformation and Kernelization∗ Hartmut Ehrig Claudia Ermel Falk H¨ uffner† Add to Reading List Source URL: www.user.tu-berlin.de Language: English - Date: 2013-01-21 07:14:53 NP-complete problems Analysis of algorithms Parameterized complexity Graph operations Kernelization Clique Intersection number Graph Path decomposition Graph theory Theoretical computer science Mathematics
104	k-Cographs are Kruskalian Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2011-06-16 14:46:21 Distance-hereditary graph Neighbourhood Clique Minor Induced path Graph coloring Graph Tree Path decomposition Graph theory Graph operations Cograph
105	Longest Paths in Planar DAGs in Unambiguous Log-Space Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2011-06-02 16:29:35 Directed acyclic graph Shortest path problem Graph coloring Planarity testing Tree Matroid theory Path decomposition Chromatic polynomial Graph theory Planar graphs Network theory
106	More Lower Bounds for Weak Sense of Direction: The Case of Regular Graphs Paolo Boldi∗ and Sebastiano Vigna† Dipartimento di Scienze dell’Informazione, Università degli Studi di Milano, Italy Abstract A graph G w Add to Reading List Source URL: vigna.di.unimi.it Language: English - Date: 2002-05-18 04:50:51 Path decomposition Trapezoid graph Graph theory Graph Connectivity
107	Constant Thresholds Can Make Target Set Selection Tractable? Morgan Chopin1?? , Andr´e Nichterlein2 , Rolf Niedermeier2 , and Mathias Weller2? ? ? 1 Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-09-21 09:31:02 Graph operations Path decomposition Clique Kernelization Vertex cover Parameterized complexity Tree decomposition Feedback vertex set Dominating set Graph theory Theoretical computer science NP-complete problems
108	ALGORITHMIC COMPLEXITY OF FINDING CROSS-CYCLES IN FLAG COMPLEXES MICHAL ADAMASZEK AND JURAJ STACHO Abstract. A cross-cycle in a flag simplicial complex K is an induced subcomplex that is isomorphic to the boundary of a c Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2014-10-30 10:03:20 Induced path Matching Clique Dominating set Interval graph Algebraic topology Line graph Path decomposition Graph theory Chordal graph Graph
109	12 Force-Directed Drawing Algorithms Stephen G. Kobourov University of Arizona Add to Reading List Source URL: cs.brown.edu Language: English - Date: 2013-06-24 01:29:28 Graph drawing Force-based algorithms Graph Shortest path problem Degree Path decomposition Layered graph drawing Graph theory Mathematics Theoretical computer science
110	Theory of Computing Systems manuscript No. (will be inserted by the editor) Constant Thresholds Can Make Target Set Selection Tractable Morgan Chopin∗ · Andr´ Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-09-10 04:14:52 Graph operations Path decomposition Vertex cover Feedback vertex set Clique Kernelization Dominating set Tree decomposition Vertex Graph theory Theoretical computer science NP-complete problems

UPDATE